import java.util.Scanner;
import java.util.Stack;
import java.util.Vector;

public class TestDemo {
    public static void main2(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int m = 2*n-1;
        int[][] array = new int[n][m];
        //初始化
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                array[i][j] = 0;
            }
        }
        array[0][0] = 1;
        for (int i = 1; i < n; i++) {
            array[i][0] = array[i][2*i] = 1;   //每一行第一个和最后一个都为1
            for (int j = 1; j < 2*i; j++) {
                if(j == 1) {     //表示左上角到右上角只有两个数
                    array[i][j] = array[i-1][j]+array[i-1][j-1];
                } else {
                    array[i][j] = array[i-1][j]+array[i-1][j-1]+array[i-1][j-2];
                }
            }
        }
        int k = 0;
        for (; k < m; k++) {
            if(array[n-1][k] % 2 == 0 ) {
                System.out.println((k-1));
                break;
            }
        }
        if(k == m) {
            System.out.println(-1);
        }
    }

    //小测试:finally不是一定会执行
    public static void main1(String[] args) {
        try {
            System.out.println("执行tyr方法");
            System.exit(0);
        } finally {
            System.out.println("执行finally");
        }
    }

    public static void main(String[] args) {
        Stack<Integer> stack = new Stack<>();
        stack.add(1);
        int a = stack.pop();
        System.out.println(a);
        Vector<Integer> vector = new Vector<>();
    }
}
